Electronic Notes in Theoretical Computer Science
نویسندگان
چکیده
Formal methods such as Z and Petri nets can be used to specify invariants that should hold during the execution of component-based applications such as those regarding changes in the architecture of the application and valid sequences of architecture reconfigurations. Integrating logic for checking and enforcing these invariants into the application’s implementation is generally done by adding appropriate code to the functional application code. In this paper, we discuss several limitations of this approach that may ensue in a disconnection between the application implementation and its formal specification. We propose an approach for specifying and enforcing architectural constraints, which combines formal methods and Aspect-Oriented Programming. We use the Z notation for describing the architectural invariants of the application and Petri nets for modeling coordination protocols. At the implementation level, aspects intercept architecture reconfiguration events and check according to the formal specification and the coordination protocol whether a reconfiguration action can be performed.
منابع مشابه
Coalgebra-to-Algebra Morphisms
Given a coalgebra p for HG, an algebra s for GH and the obvious notion of morphism from coalgebra to algebra, we observe that morphisms from Gp to s correspond to morphisms from p to Hs in the manner of an adjunction even when there is no adjunction between G and H. This appears to be one of the basic phenomena underlying the transport of special algebras. A proof of Freyd’s Iterated Square The...
متن کاملElectronic Notes in Theoretical Computer Science Security and Rewriting Techniques
Language-based security approaches to access control and information flow control must at some point rely on a language for expressing policies. However there will in general be several choices for the correct policy language for any given application, and several choices for the implementation of a policy language in a given domain. This article considers an approach to implementing the policy...
متن کاملQuantum Programming Languages: An Introductory Overview
ly. In Selinger, P. (ed.) Proc. 2nd Int. Workshop on Quantum Programming Languages, Turku, Finland, July 12– 13, pp. 57–73. Turku Centre for Computer Science. [45] Coecke, B. (2005) De-linearizing linearity: projective quantum axiomatics from strong compact closure. In Selinger, P. (ed.) Proc. 3rd Int. Workshop on Quantum Programming Languages, Chicago, USA, June 30 to July 1, pp. 43–63. Electr...
متن کاملInformation Theoretic Representations of Qubit Channels
A set of qubit channels has a classical representation when it is isomorphic to the convex closure of a group of classical channels. From Crowder and Martin (Proceedings of Quantum Physics and Logic, Electronic Notes in Theoretical Computer Science, 2009), we know that up to isomorphism there are five such sets, each corresponding to either a subgroup of the alternating group on four letters, o...
متن کاملFifth Workshop on Quantitative Aspects of Programming Languages
Chemical and biochemical systems are presented as collectives of interacting stochastic automata: each automaton represents a molecule that undergoes state transitions. This framework constitutes an artificial biochemistry, where automata interact by the equivalent of the law of mass action. We analyze several example systems and networks, both by stochastic simulation and by ordinary different...
متن کاملRelative Injectivity as Cocompleteness for a Class of Distributors
Notions and techniques of enriched category theory can be used to study topological structures, like metric spaces, topological spaces and approach spaces, in the context of topological theories. Recently in [D. Hofmann, Injective spaces via adjunction, arXiv:math.CT/0804.0326] the construction of a Yoneda embedding allowed to identify injectivity of spaces as cocompleteness and to show monadic...
متن کامل